A Probabilistic Correspondence Algorithm Using Shape Cues and Prior Information

ثبت نشده
چکیده

Correspondence of features between two or more images obtained from different views of the same object is still a challenging problem in vision. In many applications, these two views are part of a larger video sequence. The aim of this paper is to show that the original video data contains enough information (referred to as prior information) to design a robust correspondence algorithm. A doubly stochastic matrix, representing the probability of match between the features, is derived using the Sinkhorn normalization procedure. The final correspondence is obtained by minimizing the probability of error of a match between the entire constellation of features in the two sets, thus taking into account the spatial structure of the object. The method is applied for creating holistic 3D models from partial ones and the results are presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Coupled level set segmentation using a point-based statistical shape model relying on correspondence probabilities

In order to successfully perform automatic segmentation in medical images containing noise and intensity inhomogeneities, modern algorithms often rely on a priori knowledge about the respective anatomy. This is often introduced by statistical shape models (SSMs) which are typically based on one-to-one point correspondences. In this work, we propose a unified statistical framework for image segm...

متن کامل

Probabilistic Models for 2D Active Shape Recognition using Fourier Descriptors and Mutual Information

Shape recognition is essential for robots to perform tasks in both human and industrial environments. Many algorithms have been developed for shape recognition with varying results. However, few of the proposed methods actively look for additional information to improve the initial shape recognition results. We propose an initial system which performs shape recognition using the euclidean dista...

متن کامل

Correspondence between probabilistic norms and fuzzy norms

In this paper, the connection between Menger probabilistic norms and H"{o}hle probabilistic norms is discussed. In addition, the correspondence between probabilistic norms and Wu-Fang fuzzy (semi-) norms is established. It is shown that a probabilistic norm (with triangular norm $min$) can generate a Wu-Fang fuzzy semi-norm and conversely, a Wu-Fang fuzzy norm can generate a probabilistic norm.

متن کامل

Cortical Correspondence with Probabilistic Fiber Connectivity

This paper presents a novel method of optimizing point-based correspondence among populations of human cortical surfaces by combining structural cues with probabilistic connectivity maps. The proposed method establishes a tradeoff between an even sampling of the cortical surfaces (a low surface entropy) and the similarity of corresponding points across the population (a low ensemble entropy). T...

متن کامل

Iterative Most-Likely Point Registration (IMLP): A Robust Algorithm for Computing Optimal Shape Alignment

We present a probabilistic registration algorithm that robustly solves the problem of rigid-body alignment between two shapes with high accuracy, by aptly modeling measurement noise in each shape, whether isotropic or anisotropic. For point-cloud shapes, the probabilistic framework additionally enables modeling locally-linear surface regions in the vicinity of each point to further improve regi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007